Sean Cleary and Jennifer
نویسندگان
چکیده
We describe a family of elements in Thompson’s group F which present a challenge to finding canonical minimal length representatives for group elements, and which show that F is not combable by geodesics. These elements have the property that there are only two possible suffixes of long lengths for geodesic paths to these elements from the identity; one is of the form g and the other of the form g where g is an element of a finite generating set for the group.
منابع مشابه
Metric Properties of the Lamplighter Group as an Automata Group Sean Cleary and Jennifer Taback
We develop the geometry of the Cayley graph of the lamplighter group with respect to the generating set rising from its interpretation as an automata group [4]. We find metric behavior with respect to this generating set analogous to the metric behavior in the standard group theoretic generating set. This includes expressions for normal forms and geodesic paths, and families of ‘dead-end’ words...
متن کاملSean Cleary and Jennifer Taback
We study some combinatorial properties of the word metric of Thompson’s group F in the standard two generator finite presentation. We explore connections between the tree pair diagram representing an element w of F , its normal form in the infinite presentation, its word length, and minimal length representatives of it. We estimate word length in terms of the number and type of carets in the tr...
متن کاملBounding restricted rotation distance
Restricted rotation distance between pairs of rooted binary trees quantifies differences in tree shape. Cleary exhibited a linear upper bound of 12n for the restricted rotation distance between two trees with n interior nodes, and a lower bound of (n − 1)/3 if the two trees satisfy a reduction condition. We obtain a significantly improved sharp upper bound of 4n− 8 for restricted rotation dista...
متن کاملBounding Right-Arm Rotation Distances
Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to transform one tree to the other. We describe several types of rotation distance, and provide upper bounds on distances between trees with a fixed number of nodes with respect to each type. These bounds are obtained by relating each ...
متن کاملDead End Words in Lamplighter Groups and Other Wreath Products Sean Cleary and Jennifer Taback
We explore the geometry of the Cayley graphs of the lamplighter groups and a wide range of wreath products. We show that these groups have dead end elements of arbitrary depth with respect to their natural generating sets. An element w in a group G with finite generating set X is a dead end element if no geodesic ray from the identity to w in the Cayley graph Γ(G, X) can be extended past w. Add...
متن کامل